Lagrange Inversion Counts 35241-Avoiding Permutations
نویسنده
چکیده
In a previous paper, we showed that 35241-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.
منابع مشابه
Inversion Formulae on Permutations Avoiding 321
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 321-avoiding permutations on [n] with m inversions is given by
متن کاملInversion polynomials for 321-avoiding permutations: addendum
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.
متن کاملInversion polynomials for 321-avoiding permutations
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin...
متن کاملMotzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduced decompositions. This characterization is used to construct a bijection for a recent result that the number of (321, 31̄42)-avoiding permutations of length n equals the n-th Motzkin number, due to Gire, and further studied by Barcucci, Del Lungo, Pergola, Pinzani and Guibert. Similarly, we obtain...
متن کاملA Combinatorial Interpretation of the Eigensequence for Composition
The monic sequence that shifts left under convolution with itself is the Catalan numbers with 130+ combinatorial interpretations. Here we establish a combinatorial interpretation for the monic sequence that shifts left under composition: it counts permutations that contain a 3241 pattern only as part of a 35241 pattern. We give two recurrences, the first allowing relatively fast computation, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011